Strong downward Löwenheim–Skolem theorems for stationary logics, II: reflection down to the continuum
نویسندگان
چکیده
Continuing (Fuchino et al. in Arch Math Log, 2020. https://doi.org/10.1007/s00153-020-00730-x), we study the Strong Downward Lowenheim–Skolem Theorems (SDLSs) of stationary logic and their variations. In Fuchino (2020) it has been shown that SDLS for ordinary with weak second-order parameters $$\textsf {SDLS}({\mathcal {L}}^{\aleph _0}_{stat},{<}\,\aleph _2)$$ down to $${<}\,\aleph _2$$ is equivalent conjunction CH Cox’s Diagonal Reflection Principle internally clubness. We show without {SDLS}^-({\mathcal _0}_{stat},{<}\,2^{\aleph _0})$$ $${<}\,2^{\aleph _0}$$ implies size continuum $$\aleph . contrast, an internal interpretation can satisfy under being $$>\aleph This be version set also consider a this {SDLS}^{int}_+({\mathcal {L}}^{PKL}_{stat},{<}\,2^{\aleph reflection consistent assumption consistency ZFC $$+$$ “the existence supercompact cardinal” (at least) weakly Mahlo. These three “axioms” terms are consequences instances strengthening generic supercompactness which call Laver-generic supercompactness. Existence cardinal each these fixes cardinality _1$$ or very large respectively. one cardinals “ $$++$$ ” corresponding forcing axiom.
منابع مشابه
Club-guessing, stationary reflection, and coloring theorems
We obtain strong coloring theorems at successors of singular cardinals from failures of certain instances of simultaneous reflection of stationary sets. Along the way, we establish new results in club-guessing and in the general theory of ideals.
متن کاملStrong Completeness Theorems for Weak Logics of Common Belief
We show that several logics of common belief and common knowledge are not only complete, but also strongly complete, hence compact. These logics involve a weakened monotonicity axiom, and no other restriction on individual belief. The semantics is of the ordinary fixed-point type.
متن کاملOn Two Strong Converse Theorems for Stationary Discrete Memoryless Channels
In 1973, Arimoto proved the strong converse theorem for the discrete memoryless channels stating that when transmission rate R is above channel capacity C, the error probability of decoding goes to one as the block length n of code word tends to infinity. He proved the theorem by deriving the exponent function of error probability of correct decoding that is positive if and only if R > C. Subse...
متن کاملCovering theorems for the core model, and an application to stationary set reflection
We prove covering theorems for K, where K is the core model below the sharp for a strong cardinal, and give an application to stationary set reflection. 2000 Mathematics Subject Classification. 03. The author was supported in part by NSF grant DMS-0500799, and fellowships from the UCI mathematics department. This paper is the main part of the Ph.D. thesis ([2]). I would like to thank my advisor...
متن کاملReflection principles for the continuum∗
Let HC ′ denote the set of sets of hereditary cardinality less than 2ω. We consider reflection principles for HC ′ in analogy with the Levy reflection principle for HC. Let B be a class of complete Boolean algebras. The principle Max(B) says: If R(x1, . . . , xn) is a property which is provably persistent in extensions by elements of B, then R(a1, . . . , an) holds whenever a1, . . . , an ∈ HC ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive for Mathematical Logic
سال: 2021
ISSN: ['1432-0665', '0933-5846']
DOI: https://doi.org/10.1007/s00153-020-00751-6